Canonical Labelling of Site Graphs
نویسندگان
چکیده
We investigate algorithms for canonical labelling of site graphs, i.e. graphs in which edges bind vertices on sites with locally unique names. We first show that the problem of canonical labelling of site graphs reduces to the problem of canonical labelling of graphs with edge colourings. We then present two canonical labelling algorithms based on edge enumeration, and a third based on an extension of Hopcroft’s partition refinement algorithm. All run in quadratic worst case time individually. However, one of the edge enumeration algorithms runs in sub-quadratic time for graphs with "many" automorphisms, and the partition refinement algorithm runs in sub-quadratic time for graphs with "few" bisimulation equivalences. This suite of algorithms was chosen based on the expectation that graphs fall in one of those two categories. If that is the case, a combined algorithm runs in sub-quadratic worst case time. Whether this expectation is reasonable remains an interesting open problem.
منابع مشابه
On the bandwidth of Mobius graphs
Bandwidth labelling is a well known research area in graph theory. We provide a new proof that the bandwidth of Mobius ladder is 4, if it is not a $K_{4}$, and investigate the bandwidth of a wider class of Mobius graphs of even strips.
متن کاملReconfigurable Hardware Acceleration of Canonical Graph Labelling
Many important algorithms in computational biology and related subjects rely on the ability to extract and to identify sub-graphs of larger graphs; an example is to find common functional structures within Protein Interaction Networks. However, the increasing size of both the graphs to be searched and the target sub-graphs requires the use of large numbers of parallel conventional CPUs. This pa...
متن کاملGraphState - a tool for graph identification and labelling
We present python libraries for Feynman graphs manipulation. The key feature of these libraries is usage of generalization of graph representation offered by B. G. Nickel et al. In this approach graph is represented in some unique ’canonical’ form that depends only on its combinatorial type. The uniqueness of graph representation gives an efficient way for isomorphism finding, searching for sub...
متن کاملImmuno-gold Labelling of Chlamydia trachomatis
Background Chlamydia trachomatis is considered as an important cause of preventable sexually transmitted diseases worldwide. It is known to be of an obligate intracellular nature and enters its target cells via an endocytic process. As major outer membrane protein (MOMP) is one of the main candidates for the attachment and entry of chlamydia to the host cells we have tried to label the epitopes...
متن کاملA genetically encoded aldehyde for rapid protein labelling.
Using a mutant pyrrolysyl-tRNA synthetase-tRNA(Pyl)(CUA) pair, 3-formyl-phenylalanine is genetically incorporated into proteins at amber mutation sites in Escherichia coli. This non-canonical amino acid readily reacts with hydroxylamine dyes, leading to rapid and site-selective protein labelling.
متن کامل